Can there be efficient and natural FHE schemes?
نویسندگان
چکیده
In 1978, Rivest, Adleman and Dertouzos asked for algebraic systems for which useful privacy homomorphisms exist. To date, the only acknownledged result is noise based encryption combined with bootstrapping. Before that, there were several failed attempts. We prove that fully homomorphic schemes are impossible for several algebraic structures. Then we develop a characterisation of all fully homomorphic schemes and use it to analyse three examples. Finally, we propose a conjecture stating that secure FHE schemes must either have a significant ciphertext expansion or use unusual algebraic structures.
منابع مشابه
Accelerating Homomorphic Computations on Rational Numbers
Fully Homomorphic Encryption (FHE) schemes are conceptually very powerful tools for outsourcing computations on confidential data. However, experience shows that FHE-based solutions are not sufficiently efficient for practical applications yet. Hence, there is a huge interest in improving the performance of applying FHE to concrete use cases. What has been mainly overlooked so far is that not o...
متن کاملOctonion Algebra and Noise-Free Fully Homomorphic Encryption (FHE) Schemes
Brakerski showed that linearly decryptable fully homomorphic encryption (FHE) schemes cannot be secure in the chosen plaintext attack (CPA) model. In this paper, we show that linearly decryptable FHE schemes cannot be secure even in the ciphertext only security model. Then we consider the maximum security that a linearly decryptable FHE scheme could achieve. This paper designs fully homomorphic...
متن کاملPrivacy Preserving Computation in Cloud Using Noise-Free Fully Homomorphic Encryption (FHE) Schemes
With the wide adoption of cloud computing paradigm, it is important to develop appropriate techniques to protect client data privacy in the cloud. Encryption is one of the major techniques that could be used to achieve this goal. However, data encryption at the rest alone is insufficient for secure cloud computation environments. Further efficient techniques for carrying out computation over en...
متن کاملFHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
Fully homomorphic encryption over the integers (FHE-OI) is currently the only alternative to lattice-based FHE. FHE-OI includes a family of schemes whose security is based on the hardness of different variants of the approximate greatest common divisor (AGCD) problem. The majority of these works is based on the noise-free variant of AGCD which is potentially weaker than the general one. In part...
متن کاملRecent Results in Lattice-Based Cryptography
In this report we describe a fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. Firstly we introduce some definitions related to lattices and some operators which will be needed to build an efficient fully homomorphic encryption system base on LWE. The main focus in this report is to explain the new technique to building FHE schemes that is called the app...
متن کامل